Axiomatizing Weak Ready Simulation Semantics over BCCSP
نویسندگان
چکیده
Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, several authors have proposed generalizations of ready simulation to deal with internal actions. However, a thorough study of the (non-)existence of finite (in)equational bases for weak ready simulation semantics is still missing in the literature. This paper presents a complete account of positive and negative results on the axiomatizability of weak ready simulation semantics over the language BCCSP. In addition, this study offers a thorough analysis of the axiomatizability properties of weak simulation semantics.
منابع مشابه
Axiomatizing weak simulation semantics over BCCSP
This paper is devoted to the study of the (in)equational theory of the largest (pre)congruences over the language BCCSP induced by variations on the classic simulation preorder and equivalence that abstract from internal steps in process behaviours. In particular, the article focuses on the (pre)congruences associated with the weak simulation, the weak complete simulation and the weak ready sim...
متن کاملThe Equational Theory of Weak Complete Simulation Semantics over BCCSP
This paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional groundcomplete axiomatizations for the weak complete simulation precongruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equ...
متن کاملOn the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, then there exists a (sound and complete) finite equational axiomatization for the process algebra BCCSP modulo ready trace semantics. We prove that if the alphabet is infinite, then such an axiomatization does not exist...
متن کاملComplete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
This note shows that the complete and the ready simulation preorders do not have a finite inequational basis over the language BCCSP when the set of actions is a singleton. Moreover, the equivalences induced by those preorders do not have a finite (in)equational axiomatization either. These results are in contrast with a claim of finite axiomatizability for those semantics in the literature, wh...
متن کاملReady to Preorder: Get Your BCCSP Axiomatization for Free!
This paper contributes to the study of the equational theory of the semantics in van Glabbeek’s linear time branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behavioral congruence lying between ready simulati...
متن کامل